// 计算n x n矩阵中2x2矩阵个数
#include <iostream>
#include <vector>
using namespace std;

int main()
{
    std::vector<int> foo (3,0);
    std::vector<int> bar (5,0);

    bar = foo;
    foo = std::vector<int>();

    std::cout << "Size of foo: " << int(foo.size()) << '\n';
    std::cout << "Size of bar: " << int(bar.size()) << '\n';
    std::vector<int> buf = std::move(bar);
    std::cout << "Size of bar: " << int(bar.size()) << '\n';
    std::cout << "Size of buf: " << int(buf.size()) << '\n';
    std::cout << "max Size of buf: " << int(buf.max_size()) << '\n';
    std::cout << "capacity of buf: " << int(buf.capacity()) << '\n';
    
    
    std::vector<int> myvector;

  // set some content in the vector:
  for (int i=0; i<100; i++) myvector.push_back(i);

  std::cout << "size: " << myvector.size() << "\n";
  std::cout << "capacity: " << myvector.capacity() << "\n";
  std::cout << "max_size: " << myvector.max_size() << "\n";
    return 0;
}